On performance prediction of address lookup algorithms of IP routers through simulation and analysis techniques
نویسندگان
چکیده
Many address lookup methods on the IP routers have been recently proposed to improve the packet forwarding capability; nevertheless, their performance prediction is very limited because of lack of considering actual traffic characteristics in their evaluations. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more influenced by flow characteristic. In this paper, we propose new methods for predicting the router’s performance based on the statistical analysis of the Internet traffic. We also present an example of its application to the existing table lookup algorithm, and show that simulation results based on our method can provide accurate performance prediction.
منابع مشابه
Performance Prediction Method for IP Lookup Algorithms
Many address lookup methods for use on IP routers to improve their packet-forwarding capability have been proposed. However, their performance prediction ability is poor because actual traffic characteristics are not considered in their evaluation processes. The actual traffic must be considered in order to predict router performance more accurately, especially for layer 3 and 4 address lookups...
متن کاملPerformance Prediction Methods for Address Lookup Algorithms of IP Routers
Many address lookup methods for an IP router have been recently proposed to improve a packet forwarding capability, but their performance prediction is very limited because of lack of considering actual traffic characteristics. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more in...
متن کاملPerformance Prediction Method for Address Lookup Algorithms based on Statistical Traffic Analysis
Many address lookup methods for IP routers to improve a packet forwarding capability have been recently proposed, but evaluation on their performance prediction is very limited because of lack of consideration on actual traffic characteristics. It is necessary to consider the actual traffic characteristics to predict more realistic performances of routers, and in this thesis, we propose methods...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل